Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar3/ZantemaSLASHz26.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

a₁(a₁(f₂(x, y))) -> f₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))
f₂(a₁(x), a₁(y)) -> a₁(f₂(x, y))
f₂(b₁(x), b₁(y)) -> b₁(f₂(x, y))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a₁(a₁(f₂(x, y))) -> f₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))
f₂(a₁(x), a₁(y)) -> a₁(f₂(x, y))
f₂(b₁(x), b₁(y)) -> b₁(f₂(x, y))

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

A₁(a₁(f₂(x, y))) -> A₁(y)
F₂(a₁(x), a₁(y)) -> F₂(x, y)
A₁(a₁(f₂(x, y))) -> A₁(b₁(a₁(y)))
A₁(a₁(f₂(x, y))) -> A₁(b₁(a₁(b₁(a₁(x)))))
A₁(a₁(f₂(x, y))) -> A₁(x)
F₂(b₁(x), b₁(y)) -> F₂(x, y)
F₂(a₁(x), a₁(y)) -> A₁(f₂(x, y))
A₁(a₁(f₂(x, y))) -> A₁(b₁(a₁(b₁(a₁(y)))))
A₁(a₁(f₂(x, y))) -> F₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))
A₁(a₁(f₂(x, y))) -> A₁(b₁(a₁(x)))

The TRS R consists of the following rules:

a₁(a₁(f₂(x, y))) -> f₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))
f₂(a₁(x), a₁(y)) -> a₁(f₂(x, y))
f₂(b₁(x), b₁(y)) -> b₁(f₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

A₁(a₁(f₂(x, y))) -> A₁(y)
F₂(a₁(x), a₁(y)) -> F₂(x, y)
A₁(a₁(f₂(x, y))) -> A₁(b₁(a₁(y)))
A₁(a₁(f₂(x, y))) -> A₁(b₁(a₁(b₁(a₁(x)))))
A₁(a₁(f₂(x, y))) -> A₁(x)
F₂(b₁(x), b₁(y)) -> F₂(x, y)
F₂(a₁(x), a₁(y)) -> A₁(f₂(x, y))
A₁(a₁(f₂(x, y))) -> A₁(b₁(a₁(b₁(a₁(y)))))
A₁(a₁(f₂(x, y))) -> F₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))
A₁(a₁(f₂(x, y))) -> A₁(b₁(a₁(x)))

The TRS R consists of the following rules:

a₁(a₁(f₂(x, y))) -> f₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))
f₂(a₁(x), a₁(y)) -> a₁(f₂(x, y))
f₂(b₁(x), b₁(y)) -> b₁(f₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 1 SCC with 4 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

A₁(a₁(f₂(x, y))) -> A₁(y)
F₂(a₁(x), a₁(y)) -> F₂(x, y)
A₁(a₁(f₂(x, y))) -> A₁(x)
F₂(b₁(x), b₁(y)) -> F₂(x, y)
F₂(a₁(x), a₁(y)) -> A₁(f₂(x, y))
A₁(a₁(f₂(x, y))) -> F₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))

The TRS R consists of the following rules:

a₁(a₁(f₂(x, y))) -> f₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))
f₂(a₁(x), a₁(y)) -> a₁(f₂(x, y))
f₂(b₁(x), b₁(y)) -> b₁(f₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

A₁(a₁(f₂(x, y))) -> A₁(y)
A₁(a₁(f₂(x, y))) -> A₁(x)

Used argument filtering: A₁(x1) = x1
a₁(x1) = x1
f₂(x1, x2) = f₂(x1, x2)
F₂(x1, x2) = F₂(x1, x2)
b₁(x1) = x1
Used ordering: Quasi Precedence: [f_2, F_2]

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPAfsSolverProof

            ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₂(a₁(x), a₁(y)) -> F₂(x, y)
F₂(b₁(x), b₁(y)) -> F₂(x, y)
F₂(a₁(x), a₁(y)) -> A₁(f₂(x, y))
A₁(a₁(f₂(x, y))) -> F₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))

The TRS R consists of the following rules:

a₁(a₁(f₂(x, y))) -> f₂(a₁(b₁(a₁(b₁(a₁(x))))), a₁(b₁(a₁(b₁(a₁(y))))))
f₂(a₁(x), a₁(y)) -> a₁(f₂(x, y))
f₂(b₁(x), b₁(y)) -> b₁(f₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.